Parallel Hermite interpolation: An algebraic approach
نویسندگان
چکیده
منابع مشابه
Using Algebraic Geometry for Multivariate Hermite Interpolation
This paper uses some well known theorems of algebraic geometry to characterize polynomial Hermite interpolation in any dimension. Efficient numerical algorithms are presented for interpolatory curve fits through points in the plane, surface fits through points and curves in space, and in general, hypersuface fits through. points, curves, surfaces, and sub-varieties in n dimensional space. These...
متن کاملParallel Hermite Interpolation on Extended Fibonacci Cubes
This work suggests a parallel algorithm for Hermite interpolation on Extended Fibonacci Cube (n) EFC1 . The proposed algorithm has 3 phases: initialization, main and final. The main phase of the algorithm involves 3 2 N multiplications, N additions, N 2 subtractions and N divisions. In final phase we propose an efficient algorithm to accumulate the partial sums of Hermite interpolation in 2 )...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملHermite Interpolation Outperforms Nyström Interpolation
Hermite interpolation is shown to be much more stable than Nyström interpolation in the context of solving classic Fredholm second kind integral equations of potential theory in two dimensions using panel-based Nyström discretization. AMS subject classification (2000): 31A10,45B05,65D05,65R20.
متن کاملDistance-two interpolation for parallel algebraic multigrid
Algebraic multigrid (AMG) is one of the most efficient and scalable parallel algorithms for solving sparse linear systems on unstructured grids. However, for large 3D problems, the coarse grids that are normally used in AMG often lead to growing complexity in terms of memory use and execution time per AMG V-cycle. Sparser coarse grids, such as those obtained by the parallel modified independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 1989
ISSN: 0010-485X,1436-5057
DOI: 10.1007/bf02243225